Fast Algorithm for Symbol Rate Estimation
نویسندگان
چکیده
The cyclic autocorrelation of common digital modulation is researched, and the relationship between the cyclic autocorrelation and the delay, corresponding to the symbol rate, is deduced, then a searching algorithm for the symbol rate is proposed. Theoretical analyses and simulation results show that this method has less computation complexity and is also quite accurate. The estimation result is almost immune to the stationary noise. It’s of practical value to modulation recognition and blind demodulation. key words: symbol rate; cyclic autocorrelation; cyclostationarity
منابع مشابه
An Improved Model for Symbol Rate Estimation Based on Wavelet Transform
In non-cooperative communication system, symbol rate is a crucial part of parameter estimation. Based on the wavelet transform, an improved symbol rate estimation model is proposed. Without a prior knowledge, we raised a better symbol rate pre-estimation method in view of corrected average periodogram’s smoothing power spectrum. By choosing the optimal wavelet scale and fast Fourier transform, ...
متن کاملHarmonics Estimation in Power Systems using a Fast Hybrid Algorithm
In this paper a novel hybrid algorithm for harmonics estimation in power systems is proposed. The estimation of the harmonic components is a nonlinear problem due to the nonlinearity of phase of sinusoids in distorted waveforms. Most researchers implemented nonlinear methods to extract the harmonic parameters. However, nonlinear methods for amplitude estimation increase time of convergence. Hen...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملEM Algorithm for Sequence Estimation over Gauss-Markov ISI Channels
| This paper presents a new algorithm, based on an EM (Expectation-Maximization) formulation, for ML (maximum likelihood) sequence estimation over unknown ISI (inter-symbol interference) channels with random channel coeecients which have a Gauss-Markov fast time-varying distribution. By using the EM formulation to marginalize over the channel coeecient distribution, maximum-likelihood estimates...
متن کاملSequence Estimation over Linearly-Constrained Random Channels
This paper presents a new approach using EM (Expectation-Maximization) algorithms for ML (maximum likelihood) sequence estimation over unknown ISI (inter-symbol interference) channels with linearly–constrained random channel coefficients which may be fast time-varying. By using the EM formulation to marginalize over the underlying channel coefficient distribution, maximum-likelihood estimates o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 88-B شماره
صفحات -
تاریخ انتشار 2005